Symbolic Error Analysis and Robot Planning

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Hybrid Symbolic Robot Motion Planning and Control †

This paper addresses the motion planning problem using hybrid symbolic techniques. The proposed approach develops a unified hierarchical hybrid control framework using a bismulation-based abstraction technique over the partitioned motion space that can be applied to autonomous aerial robots (3-D symbolic motion planning) or ground vehicles (2-D symbolic motion planning). The bisimulation relati...

متن کامل

Integrated Symbolic Planning in the Tidyup-Robot Project

We present the integration of our symbolic planner as the high-level executive in the Tidyup-Robot project. Tidyup-Robot deals with mobile manipulation scenarios in a household setting. We introduce our system architecture and report on issues and advantages observed during development and deployment.

متن کامل

Stable Gait Planning and Robustness Analysis of a Biped Robot with One Degree of Underactuation

In this paper, stability analysis of walking gaits and robustness analysis are developed for a five-link and four-actuator biped robot. Stability conditions are derived by studying unactuated dynamics and using the Poincaré map associated with periodic walking gaits. A stable gait is designed by an optimization process satisfying physical constraints and stability conditions. Also, considering...

متن کامل

Approximate Symbolic Analysis with Interval Error Estimation

The paper deals with an enhanced method for matrix-based approximate symbolic analysis. The method assures the validity of approximated expressions over a certain interval of network parameters by means of the sensitivity analysis. A computationally effective algorithm is presented. Key-Words: Approximate symbolic analysis, linear circuits, computer methods

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The International Journal of Robotics Research

سال: 1982

ISSN: 0278-3649,1741-3176

DOI: 10.1177/027836498200100403